Building a Problem Library for First-Order Modal Logics

نویسندگان

  • Thomas Raths
  • Jens Otten
چکیده

First-order modal logics have many applications, e.g. in planning and program verification. Whereas comprehensive and standardized problem libraries exist for, e.g., classical (TPTP library) and intuitionistic (ILTP library) logic, nothing comparable is so far available for firstorder modal logics. The aim of the Quantified Modal Logic Theorem Proving (QMLTP) library is to close this gap by providing a comprehensive set of problems for various first-order modal logics. We present a preliminary version of this library, which includes 200 problems represented in an extended TPTP syntax. The main purpose of the QMLTP library is to put the testing and evaluation of automated theorem proving (ATP) systems for first-order modal logic on a firm basis, make meaningful system evaluations and comparison possible, and to measure practical progress in ATP for modal logics. We would like to invite all interested users to submit problems and ATP systems for first-order modal logics.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The QMLTP Problem Library for First-Order Modal Logics

The Quantified Modal Logic Theorem Proving (QMLTP) library provides a platform for testing and evaluating automated theorem proving (ATP) systems for first-order modal logics. The main purpose of the library is to stimulate the development of new modal ATP systems and to put their comparison onto a firm basis. Version 1.1 of the QMLTP library includes 600 problems represented in a standardized ...

متن کامل

Evaluating Automated Theorem Provers for First-Order Modal Logics

First-order modal logics have many applications, e.g., in planning, natural language processing, program verification, querying knowledge bases, and modeling communication. This paper gives an overview of several new implementations of theorem provers for first-order modal logics based on different proof calculi. Among these calculi are the standard sequent calculus, a prefixed tableau calculus...

متن کامل

Implementing Connection Calculi for First-order Modal Logics

This paper presents an implementation of an automated theorem prover for first-order modal logic that works for the constant, cumulative, and varying domain of the modal logics D, T, S4, and S5. It is based on the connection calculus for classical logic and uses prefixes representing world paths and a prefix unification algorithm to capture the restrictions given by the Kripke semantics of the ...

متن کامل

Implementing and Evaluating Provers for First-order Modal Logics

While there is a broad literature on the theory of firstorder modal logics, little is known about practical reasoning systems for them. This paper presents several implementations of fully automated theorem provers for first-order modal logics based on different proof calculi. Among these calculi are the standard sequent calculus, a prefixed tableau calculus, an embedding into simple type theor...

متن کامل

Strength Factors: An Uncertainty System for a Quantified Modal Logic

We present a new system S for handling uncertainty in a quantified modal logic (first-order modal logic). The system is based on both probability theory and proof theory. The system is derived from Chisholm’s epistemology. We concretize Chisholm’s system by grounding his undefined and primitive (i.e. foundational) concept of reasonableness in probability and proof theory. S can be useful in sys...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009